Improved Simulated Annealing Genetic Algorithm based Low power mapping for 3D NoC
نویسندگان
چکیده
منابع مشابه
An Improved Algorithm for 3D NoC Floorplanning Based on Particle Swarm Optimization of Nesting Simulated Annealing
In this paper, an improved floorplanning algorithm, named the floorplanning algorithm based on particle swarm optimization algorithm nesting simulated annealing to optimize the floorplans (PSO-SA-NoC), has been proposed with simulations conducted to verify this algorithm. The simulation results are compared with the original Simulated Annealing-NoC. The results show that the CPU’s process time ...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملAn Adaptive Genetic Algorithm for Mesh-Based NoC Application Mapping
Application mapping is one of the key problems of Network-on-Chip (NoC) design. It maps the cores of application to the processing elements of the NoC topology. This paper presents a novel approach for NoC application mapping, which uses adaptive genetic algorithm (AGA) in the mapping. The proposed approach adaptively varies the probabilities of crossover and mutation operators in genetic algor...
متن کاملAlgorithm Mapping with Parallel Simulated Annealing Algorithm Mapping with Parallel Simulated Annealing ?
This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...
متن کاملImproved Genetic Algorithm Based on Simulated Annealing and Quantum Computing Strategy for Mining Association Rules
By use of the properties of ant colony algorithm and genetic algorithm, a novel ant colony genetic hybrid algorithm, whose framework of hybrid algorithm is genetic algorithm, is proposed to solve the traveling salesman problems. The selection operator is an artificial version of natural selection, and chromosomes with better length of tour have higher probabilities of being selected in the next...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2018
ISSN: 2261-236X
DOI: 10.1051/matecconf/201823202022